Efficient and Universal Corruption Resilient Fountain Codes
نویسندگان
چکیده
منابع مشابه
Corruption Resilient Fountain Codes
A new aspect for erasure coding is considered, namely, the possibility that some portion of the arriving packets are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths that are leading to the receiver and are controlled by an adversary. Alternatively, in case packets are collected from several sources, the corruptio...
متن کاملUniversal Decremental Redundancy Compression with Fountain Codes
A new universal noise-robust lossless compression algorithm based on a decremental redundancy approach with Fountain codes is proposed. The binary entropy code is harnessed to compress complex sources with the addition of a preprocessing system in this paper. Both the whole binary entropy range compression performance and the noise-robustness of an existing incremental redundancy Fountain code ...
متن کاملCorruption and Recovery-Efficient Locally Decodable Codes
A (q, δ, )-locally decodable code (LDC) C : {0, 1} → {0, 1} is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 + from C(x) by a randomized algorithm that queries only q positions of C(x), even if up to δm positions of C(x) are corrupted. If C is a linear map, then the LDC is linear. We give improved constructions of LDCs in te...
متن کاملFountain Codes
Fountain codes are record-breaking sparse-graph codes for channels with erasures – such as the internet, where files are transmitted in multiple small packets, each of which is either received without error or not received. Standard file-transfer protocols simply chop a file up into K packet-sized pieces, then repeatedly transmit each packet until it is successfully received. A back-channel is ...
متن کاملEfficient universal noiseless source codes
Although the existence of universal noiseless variable-rate codes for the class of discrete stationary ergodic sources has previously been established, very few practical universal encoding methods are available. Efficient implementable universal source coding techniques are discussed in this paper. Results are presented on source codes for which a small value of the maximum redundancy is achie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2013
ISSN: 0090-6778
DOI: 10.1109/tcomm.2013.082813.110754